Research on Hybrid Real-Time System Scheduling Algorithm for Multiprocessor Environment
نویسندگان
چکیده
منابع مشابه
A Knapsack Scheduling Algorithm for Soft Real-time Multiprocessor System
Due to the development of commercial multicore architectures, scheduling in Multiprocessor real-time system has attracted huge research interests and various algorithms have been proposed. However, most prior research on real-time scheduling on multiprocessors has focused only on hard real-time systems where no deadline may ever be missed. Due to the increasing need of soft realtime multiproces...
متن کاملFuzzy Scheduling Algorithm for Real –Time multiprocessor system
In a multiprocessor environment scheduling is very essentially done with greater challenges. Researchers are in the edge of finding solutions to these challenges. Scheduling is the art of allocating limited resources to competing tasks over time. A feasible schedule satisfies the constraints that are associated with any particular set of tasks and resources. So as to improve the performance of ...
متن کاملHybrid Multiprocessor Real-Time Scheduling Approach
Real-time scheduling is one of the most important aspects of a real-time system design. To achieve a real-time system’s requirement, especially to be fast, multiprocessor systems are used. Generally, multiprocessor real-time scheduling algorithms fall into one the two well-known approaches: Partitioning or Global. The partitioning approach has acceptable overhead for underlying system but can N...
متن کاملAn Optimal Multiprocessor Real-Time Scheduling Algorithm
An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisses certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of processors and upper bounds on the number of preemptions in a given time interval and for any single t...
متن کاملACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems
The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1732/1/012069